منابع مشابه
An upper bound for the minimum rank of a graph
For a graph G of order n, the minimum rank of G is defined to be the smallest possible rank over all real symmetric n × n matrices A whose (i, j)th entry (for i 6= j) is nonzero whenever {i, j} is an edge in G and is zero otherwise. We prove an upper bound for minimum rank in terms of minimum degree of a vertex is valid for many graphs, including all bipartite graphs, and conjecture this bound ...
متن کاملAn upper bound to the second Hankel functional for the class of gamma-starlike functions
The objective of this paper is to obtain an upper bound to the second Hankel determinant $|a_{2}a_{4}-a_{3}^{2}|$ for the function $f$, belonging to the class of Gamma-starlike functions, using Toeplitz determinants. The result presented here include two known results as their special cases.
متن کاملAn Upper Bound on the First Zagreb Index in Trees
In this paper we give sharp upper bounds on the Zagreb indices and characterize all trees achieving equality in these bounds. Also, we give lower bound on first Zagreb coindex of trees.
متن کاملTensor Rank : Some Lower and Upper
The results of Strassen [25] and Raz [19] show that good enough tensor rank lower bounds have implications for algebraic circuit/formula lower bounds. We explore tensor rank lower and upper bounds, focusing on explicit tensors. For odd d, we construct field-independent explicit 0/1 tensors T : [n]d -+ F with rank at least 2n td/ 2j + n 8(d Ig n). This improves the lower-order terms in known low...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ISRN Geometry
سال: 2013
ISSN: 2090-6315
DOI: 10.1155/2013/241835